Describing Computer Languages
نویسنده
چکیده
Concept Definitions First we present the abstract construct definitions that were used for the SDL2000 meta-model. There are different levels of abstractions. Some constructs are so general that they are used in virtually every object-oriented language, others are more specific and may only be reused among related languages or only within one language. Figure 3.9 shows the abstract structure constructs used by most objectoriented languages. A detailed explanation and documented development of that model can be found in [64]. These constructs are not only relevant to SDL, they are also used in the meta-models of UML and the meta-meta-model of MOF. But even more abstract constructs could be obtained from SDL’s notation itself. Even if they may turn out to be more specific, perhaps distinctive to SDL, they still allow a more compact and therefore easier to understand and easier to use meta-model. Figure 3.10 presents the additional abstract constructs that could be identified in the SDL-2000 notation. A few concrete meta-model classes, those that are marked grey, are shown too. A few remarks: • Many SDL constructs reference a body of some sort. Procedures for example must contain a state automaton defining their behaviour. This state automaton is referred to as a body. The same is true for process typed Agents or the bodies in Composite-state types. To respect the varying nature of bodies, they are modelled to be the most abstract construct: ModelElement. 80 3 Representation – Describing Textual Notations
منابع مشابه
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملTime to change the “ D ” in “ DEL ”
The “D” in “DEL” stands for “documenting” – a code word for linguists that means the collection of linguistic data in audio and written form. The DEL (Documenting Endangered Languages) program run by the NSF and NEH is thus centered around building and archiving data resources for endangered languages. This paper is an argument for extending the ‘D’ to include “describing” languages in terms of...
متن کاملTerm Rewriting Systems : Syntax , Semantics , and Pragmatics Extended
We present a formalism called Addressed Term Rewriting Systems, which can be used to define the operational semantics of programming languages, especially those involving sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, as for instance the family of languages called λObja, involving both...
متن کاملA Declarative Approach to the Specification of Large-Scale System Configurations
Many tools are available for assisting in the configuration of large numbers of inter-related computer systems, but there has been little work on languages which provide a convenient high-level way to specify and manage the complexity of these configurations. Building on experience with existing configuration systems and other languages, this paper explores the possibility of developing a large...
متن کاملThe Varieties of Programming Language Semantics And Their Uses
Formal descriptions of syntax are quite popular: regular and context-free grammars have become accepted as useful for documenting the syntax of programming languages, as well as for generating efficient parsers; attribute grammars allow parsing to be linked with typechecking and code generation; and regular expressions are extensively used for searching and transforming text. In contrast, forma...
متن کاملthe Sixth International Workshop on Languages
The notion of isolating the \common case" is a well known computer science principle. This paper describes ZPL, a language that treats data parallelism as a common case of MIMD parallelism. This separation of concerns has many bene ts. It allows us to de ne a clean and concise language for describing data parallel computations, and this in turn leads to e cient parallel execution. Our particula...
متن کامل